Geometric algorithms are a subset of algorithms that deal with geometric problems, such as computing the convex hull of a set of points, finding the closest pair of points, or determining intersections of geometric objects. These algorithms are used in a variety of fields, including computer graphics, robotics, computer-aided design, and geographic information systems. They often involve manipulating geometric shapes, such as points, lines, circles, polygons, and more complex structures, to solve computational problems efficiently. Geometric algorithms make use of techniques from computational geometry, a branch of computer science that focuses on the study of algorithms for solving geometric problems.